FPL Implementation of Systolic Sequence Alignment

نویسندگان

  • Dzung T. Hoang
  • Daniel P. Lopresti
چکیده

This paper describes an implementation of a novel systolic array for sequence alignment on the SPLASH reconfigurable logic array. The systolic array operates in two phases. In the first phase, a sequence comparison array due to Lopresti [2] is used to compute a matrix of distances which is stored in local RAM. In the second phase, the stored distances are used by the alignment array to produce a binary encoding of the sequence alignment. Preliminary benchmarks show that the SPLASH implementation performs several orders of magnitude faster than implementation on supercomputers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large Scale Protein Sequence Alignment Using FPGA Reprogrammable Logic Devices

In this paper we show how to significantly accelerate SmithWaterman protein sequence alignment algorithm using reprogrammable logic devices – FPGAs (Field Programmable Gate Array). Due to perfect sensitivity, the Smith-Waterman algorithm is important in a field of computational biology but computational complexity makes it impractical for large database searches when running on general purpose ...

متن کامل

A Systolic Array for the Sequence Alignment Problem

This report introduces a new systolic algorithm for the sequence alignment problem. This work builds upon an existing systolic array for computing the edit distance between two sequences. The alignment array is meant to be used as the second phase in a two-phase design with a modiied edit distance array serving as the rst phase. An implementation on the SPLASH programmable logic array is descri...

متن کامل

A Smith-Waterman Systolic Cell

With an aim to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared and searched for matching or near-matching patterns. This kind of similarity calculation is known as sequence alignment. To date, the most popular algorithms for this operation are heuristic approaches such as BLAST and FASTA which give high s...

متن کامل

An In-Storage Implementation of Smith-Waterman in Resistive CAM

An in-storage implementation of the Smith-Waterman sequence alignment algorithm on a resistive content addressable memory (ReCAM) based storage is proposed. The ReCAM native compare operation is used to find matching basepairs in a fixed number of cycles, regardless of the sequence length. Our in-storage implementation is simulated and compared to state-of-the-art systolic arrays and GPU-based ...

متن کامل

FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers

We present the FPGA implementation of an extension of the binary plus–minus systolic algorithm which computes the GCD (greatest common divisor) and also the normal form of a rational number, without using division. A sample array for 8 bit operands consumes 83.4% of an Atmel 40K10 chip and operates at 25 MHz.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992